Splitting a Delaunay Triangulation in Linear Time1
نویسندگان
چکیده
Computing the Delaunay triangulation of n points requires usually a minimum of (n log n) operations, but in some special cases where some additional knowledge is provided, faster algorithms can be designed. Given two sets of points, we prove that, if the Delaunay triangulation of all the points is known, the Delaunay triangulation of each set can be computed in randomized expected linear time.
منابع مشابه
Delaunay Properties of Digital Straight Segments
We present new results concerning the Delaunay triangulation of the set of points of pieces of digital straight lines. More precisely, we show how the triangulation topology follows the arithmetic decomposition of the line slope as well as its combinatorial decomposition (splitting formula). A byproduct is a linear time algorithm for computing the Delaunay triangulation and the Voronoi diagram ...
متن کاملTriangulating the Square and Squaring the Triangle : 1 Quadtrees and Delaunay Triangulations are Equivalent
4 We show that Delaunay triangulations and compressed quadtrees are equivalent structures. More precisely, 5 we give two algorithms: the first computes a compressed quadtree for a planar point set, given the Delaunay 6 triangulation; the second finds the Delaunay triangulation, given a compressed quadtree. Both algorithms 7 run in deterministic linear time on a pointer machine. Our work builds ...
متن کاملLearning Qualitative Models through Partial Derivatives by Padé
Padé is a new method for learning qualitative models from observation data by computing partial derivatives from the data. Padé estimates partial derivatives of a target function from the learning data by splitting the attribute space into triangles or stars from Delaunay triangulation, or into tubes, and computing the linear interpolation or regression within these regions. Generalization is t...
متن کاملAdaptive Image Segmentation by Combining Photometric Invariant Region and Edge Information
ÐAn adaptive image segmentation scheme is proposed employing the Delaunay triangulation for image splitting. The tessellation grid of the Delaunay triangulation is adapted to the semantics of the image data by combining region and edge information. To achieve robustness against imaging conditions (e.g., shading, shadows, illumination, and highlights), photometric invariant similarity measures, ...
متن کاملMeshing Piecewise Linear Complexes by Constrained Delaunay Tetrahedralizations
We present a method to decompose an arbitrary 3D piecewise linear complex (PLC) into a constrained Delaunay tetrahedralization (CDT). It successfully resolves the problem of non-existence of a CDT by updating the input PLC into another PLC which is topologically and geometrically equivalent to the original one and does have a CDT. Based on a strong CDT existence condition, the redefinition is d...
متن کامل